Solving the Biobjective Minimum Spanning Tree problem using a k-best algorithm
نویسندگان
چکیده
We consider a two-phase method for computing the complete set of efficient solutions of the biobjective minimum spanning tree problem. The first phase computes the extreme efficient solutions by expanding the convex hull of the feasible space. The second phase repeatedly applies a k-best minimum spanning tree algorithm to find all nonextreme efficient solutions. We report results of our computational experiments comparing the performance of this method with another two-phase method, where the second phase is based on a branch-and-bound computation. The “k-best” method performs significantly better in our tests.
منابع مشابه
SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملUsing necessarily weak efficient solutions for solving a biobjective transportation problem with fuzzy objective functions coefficients
This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...
متن کاملOPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کاملA Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for k-Minimum Spanning Tree Problems
A combinatorial optimization problem, namely kMinimum Spanning Tree Problem, is to find a subtree with exactly k edges in an undirected graph G , such that the sum of edges’ weights is minimal. where graph G is made up of a set of vertices and weight attached edges. Since this problem is NP-hard, heuristic and metaheuristic methods are widely adopted for solving large instances. In this paper, ...
متن کامل